Reasoning About and Dynamically Posting n-ary Constraints in ADOPT

نویسندگان

  • Federico Pecora
  • P. Jay Modi
  • Paul Scerri
چکیده

This article describes an approach to solving distributed constraint optimization problems (DCOP) with n-ary constraints. A key instance of this problem is distributed resource-constrained task scheduling, in which limited resource capacities implicitly imply n-ary relations among the start-times of the tasks. We describe ADOPT-N, an extension of ADOPT [16], a recent successful algorithm for DCOP. ADOPT-N is an optimal asynchronous distributed n-ary constraint optimization algorithm in which specific agents are empowered with n-ary constraint evaluation capabilities. We show how the algorithm’s correctness and optimality relies on (1) the choice of which agents to dedicate to constraint evaluation, and (2) an admissible (partial) variable ordering. Moreover, we demonstrate empirically how ADOPT-N’s performance depends on how much knowledge about the n-ary violations that can arise during resolution can be provided to the algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Global Constraints: A First View

Global constraints proved themselves to be an efficient tool for modelling and solving large-scale real-life combinatorial problems. They encapsulate a set of binary constraints and using global reasoning about this set they filter the domains of involved variables better than arc consistency among the set of binary constraints. Moreover, global constraints exploit semantic information to achie...

متن کامل

Application of fundamental relations on n-ary polygroups

The class of  $n$-ary polygroups is a certain subclass of $n$-ary hypergroups, a generalization of D{"o}rnte $n$-arygroups and  a generalization of polygroups. The$beta^*$-relation and the $gamma^*$-relation are the smallestequivalence relations on an $n$-ary polygroup $P$ such that$P/beta^*$ and $P/gamma^*$ are an $n$-ary group and acommutative $n$-ary group, respectively. We use the $beta^*$-...

متن کامل

NEW TYPES OF FUZZY n-ARY SUBHYPERGROUPS OF AN n-ARY HYPERGROUP

In this paper, the new notions of ``belongingness ($in_{gamma}$)"and ``quasi-coincidence ($q_delta$)"  of a fuzzy point with a fuzzyset are  introduced. By means of this new idea, the  concept of$(alpha,beta)$-fuzzy $n$-ary subhypergroup of an $n$-aryhypergroup is given, where $alpha,betain{in_{gamma}, q_{delta},in_{gamma}wedge q_{delta}, ivq}$,  andit is shown that, in 16 kinds of $(alpha,beta...

متن کامل

FUZZY ROUGH N-ARY SUBHYPERGROUPS

Fuzzy rough n-ary subhypergroups are introduced and characterized.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006